Estimation Of Distribution Algorithm Research Articles

Estimation-of-Distribution Algorithms for Multi-Valued Decision Variables

The majority of research on estimation-of-distribution algorithms (EDAs) concentrates on pseudo-Boolean optimization and permutation problems, leaving the domain of EDAs for problems in which the decision variables can take more than two values, but which are not permutation problems, mostly unexplored. To render this domain more accessible, we propose a natural way to extend the known univariate EDAs to this setting. Different from a naïve reduction to the binary case, our approach avoids additional constraints.Since understanding genetic drift is crucial for an optimal parameter choice, we extend the known quantitative analysis of genetic drift to EDAs for multi-valued, categorical variables. Roughly speaking, when the variables take r different values, the time for genetic drift to become significant is r times shorter than in the binary case. Consequently, the update strength of the probabilistic model has to be chosen r times lower now.To investigate how desired model updates take place in this framework, we undertake a mathematical runtime analysis on the r-valued LeadingOnes problem. We prove that with the right parameters, the multi-valued UMDA solves this problem efficiently in O(rln⁡(r)2n2ln⁡(n)) function evaluations. This bound is nearly tight as our lower bound Ω(rln⁡(r)n2ln⁡(n)) shows.Overall, our work shows that our good understanding of binary EDAs naturally extends to the multi-valued setting, and it gives advice on how to set the main parameters of multi-values EDAs.

Improving the artificial bee colony algorithm with a proprietary estimation of distribution mechanism for protein–ligand docking

The protein–ligand docking problem plays an essential role in structure-based drug design. The challenge for a protein–ligand docking method is how to execute an efficient conformational search to explore a well-designed scoring function. In this study, we improved the artificial bee colony (ABC) algorithm and proposed an approach called ABC-EDM to solve the protein–ligand docking problem. ABC-EDM employs the scoring function of the classical AutoDock Vina to evaluate a solution during docking simulation. ABC-EDM adopts the search framework of the canonical ABC algorithm to execute conformational search. By further investigating the characteristics of the protein–ligand docking problem, a proprietary search mechanism inspired by estimation of distribution algorithm, i.e., estimation of distribution mechanism (EDM), is designed to enhance the performance of ABC-EDM. To verify the effectiveness of the proposed ABC-EDM, we compare it with three variants of the ABC algorithm, three evolutionary computation algorithms, and AutoDock Vina. The experimental results show that ABC-EDM can effectively solve the protein–ligand docking problem, and it can achieve a success rate 5% higher than AutoDock Vina on the GOLD dataset. This study reveals that taking advantage of problem-specific information about the protein–ligand docking problem to enhance a docking method contributes to solving this problem.

Maximizing Net Present Value for Resource Constraint Project Scheduling Problems with Payments at Event Occurrences Using Approximate Dynamic Programming

Resource Constraint Project Scheduling Problems with Discounted Cash Flows (RCPSPDC) focuses on maximizing the net present value by summing the discounted cash flows of project activities. An extension of this problem is the Payment at Event Occurrences (PEO) scheme, where the client makes multiple payments to the contractor upon completion of predefined activities, with additional final settlement at project completion. Numerous approximation methods such as metaheuristics have been proposed to solve this NP-hard problem. However, these methods suffer from parameter control and/or the computational cost of correcting infeasible solutions. Alternatively, approximate dynamic programming (ADP) sequentially generates a schedule based on strategies computed via Monte Carlo (MC) simulations. This saves the computations required for solution corrections, but its performance is highly dependent on its strategy. In this study, we propose the hybridization of ADP with three different metaheuristics to take advantage of their combined strengths, resulting in six different models. The Estimation of Distribution Algorithm (EDA) and Ant Colony Optimization (ACO) were used to recommend policies for ADP. A Discrete cCuckoo Search (DCS) further improved the schedules generated by ADP. Our experimental analysis performed on the j30, j60, and j90 datasets of PSPLIB has shown that ADP–DCS is better than ADP alone. Implementing the EDA and ACO as prioritization strategies for Monte Carlo simulations greatly improved the solutions with high statistical significance. In addition, models with the EDA showed better performance than those with ACO and random priority, especially when the number of events increased.

A novel differential evolution algorithm with multi-population and elites regeneration.

Differential Evolution (DE) is widely recognized as a highly effective evolutionary algorithm for global optimization. It has proven its efficacy in tackling diverse problems across various fields and real-world applications. DE boasts several advantages, such as ease of implementation, reliability, speed, and adaptability. However, DE does have certain limitations, such as suboptimal solution exploitation and challenging parameter tuning. To address these challenges, this research paper introduces a novel algorithm called Enhanced Binary JADE (EBJADE), which combines differential evolution with multi-population and elites regeneration. The primary innovation of this paper lies in the introduction of strategy with enhanced exploitation capabilities. This strategy is based on utilizing the sorting of three vectors from the current generation to perturb the target vector. By introducing directional differences, guiding the search towards improved solutions. Additionally, this study adopts a multi-population method with a rewarding subpopulation to dynamically adjust the allocation of two different mutation strategies. Finally, the paper incorporates the sampling concept of elite individuals from the Estimation of Distribution Algorithm (EDA) to regenerate new solutions through the selection process in DE. Experimental results, using the CEC2014 benchmark tests, demonstrate the strong competitiveness and superior performance of the proposed algorithm.

A Joint Scheduling Scheme for WiFi Access TSN.

In the context of Industry 4.0, industrial production equipment needs to communicate through the industrial internet to improve the intelligence of industrial production. This requires the current communication network to have the ability of large-scale equipment access, multiple communication protocols/heterogeneous systems interoperability, and end-to-end deterministic low-latency transmission. Time-sensitive network (TSN), as a new generation of deterministic Ethernet communication technology, is the main development direction of time-critical communication technology applied in industrial environments, and Wi-Fi technology has become the main way of wireless access for users due to its advantages of high portability and mobility. Therefore, accessing WiFi in the TSN is a major development direction of the current industrial internet. In this paper, we model the scheduling problem of TSN and WiFi converged networks and propose a scheme based on a greedy strategy distributed estimation algorithm (GE) to solve the scheduling problem. Compared with the integer linear programming (ILP) algorithm and the Tabu algorithm, the algorithm implemented in this paper outperforms the other algorithms in being able to adapt to a variety of different scenarios and in scheduling optimization efficiency, especially when the amount of traffic to be deployed is large.

Distributed event-triggered estimation for dynamic average consensus: A perturbation-injected privacy-preservation scheme

Previous studies on the distributed estimation problem for dynamic average consensus of multi-agent networks are usually based on the assumption that each agent continuously and honestly shares information with its neighbors. To relax this assumption, this paper focuses on the distributed event-triggered private estimation problem. By injecting random perturbations into the original reference signal, an adaptive robust distributed privacy-preserving event-triggered estimation algorithm is proposed. With the proposed algorithm, the convergence of the estimation error is guaranteed under intermittent communication, while protecting the private reference signal information from disclosure. To determine the timing for communication, an adaptive distributed dynamic triggering mechanism with a dynamically updated internal triggering variable is designed. In addition, a dynamically updated adaptive gain instead of a static gain is employed in the estimation algorithm and triggering mechanism to eliminate the dependence on some global information. Finally, numerical simulation results are presented to illustrate the validity of the theoretical results.

An Estimation of Distribution Algorithm With Resampling and Local Improvement for an Operation Optimization Problem in Steelmaking Process

An Estimation of Distribution Algorithm With Resampling and Local Improvement for an Operation Optimization Problem in Steelmaking Process

Distributed set-membership estimation for automated straddle carriers using smart sensors

Considering the harsh environment of the port, automated straddle carriers, characterized by their large size, tall frame, and high center of gravity, may experience instability during steering and transportation due to inaccurate state estimation. Thus, this paper explores state estimation techniques for automated straddle carriers utilizing smart sensors which are capable of data measurement and processing. First, using the steering principles and lateral characteristics of automated straddle carriers, a dynamic linear model is established based on Newton’s second law of motion. Then, in order to enhance the reliability and flexibility of state estimation, a distributed smart sensor network structure is introduced. In addition, considering the challenge of unknown-but-bounded noise and the precision demands of the considered automated straddle carrier, a modified distributed set-membership estimation algorithm is proposed and is derived sufficient conditions for the existence of the estimation set for the considered automated straddle carriers. Finally, the effectiveness and superiority of the proposed method are demonstrated by performance analyses.

A Reinforcement-Learning-Based 3-D Estimation of Distribution Algorithm for Fuzzy Distributed Hybrid Flow-Shop Scheduling Considering On-Time-Delivery.

With the increasing level of mass-customization and globalization of competition, environmentally friendly production scheduling for distributed manufacturing considering customer satisfaction has received growing attention. Meanwhile, uncertain scheduling is becoming a force to be considered within intelligent manufacturing industries. However, little research has been found that surveyed the uncertain distributed scheduling considering both energy consumption and customer satisfaction. In this article, the fuzzy distributed hybrid flow-shop scheduling problem considering on-time delivery (FDHFSP-OTD) is addressed, and a 3-D estimation of distribution algorithm (EDA) with reinforcement learning (RL) is proposed to minimize the makespan and total energy consumption while maximizing delivery accuracy. First, two heuristics and a random method are designed and used cooperatively for initialization. Next, an EDA with a 3-D probability matrix is innovated to generate offspring. Then, a biased decoding method based on Q -learning is proposed to adjust the direction of evolution self-adaptively. Moreover, a local intensification strategy is employed for further enhancement of elite solutions. The effect of major parameters is analyzed and the best combination of values is determined through extensive experiments. The numerical results prove the effectiveness of each specially designed strategy and method, and the comparisons with existing algorithms demonstrate the high-potential of the 3D-EDA/RL in solving the FDHFSP-OTD.

Distributed order estimation for continuous-time stochastic systems

AbstractIn this paper, we investigate the distributed estimation problem of continuous-time stochastic dynamic systems over sensor networks when both the system order and parameters are unknown. We propose a local information criterion (LIC) based on the $$L_0$$ L 0 penalty term. By minimizing LIC at the diffusion time instant and utilizing the continuous-time diffusion least squares algorithm, we obtain a distributed estimation algorithm to simultaneously estimate the unknown order and the parameters of the system. By dealing with the effect of the system noises and the coupling relationship between estimation of system orders and parameters, we establish the almost sure convergence results of the proposed distributed estimation algorithm. Furthermore, we give a simulation example to verify the effectiveness of the distributed algorithm in estimating the system order and parameters.

Distributed Localization for Multi-Agent Systems With Random Noise Based on Iterative Learning.

This article is concerned with the real-time localization problem for the dynamic multi-agent systems with measurement and communication noises under directed graphs. The barycentric coordinates are introduced to describe the relative position between agents. A novel robust distributed localization estimation algorithm based on iterative learning is proposed. The relative-distance unbiased estimator constructed from the historical iterative information is used to suppress the measurement noise. The designed stochastic approximation method with two iterative-varying gains is used to inhibit the communication noise. Under the zero-mean and independent distributed conditions on the measurement and communication noises, the asymptotic convergence of the proposed methods is derived. The numerical simulation and the QBot-2e robot experiment are conducted to test and verify the effectiveness and the practicability of the proposed methods.

Keep it unbiased: a comparison between estimation of distribution algorithms and deep learning for human interaction-free side-channel analysis

Keep it unbiased: a comparison between estimation of distribution algorithms and deep learning for human interaction-free side-channel analysis

Distributed cooperative tracking and cooperative guidance against maneuvering aerial target

This paper designs finite-time distributed state estimation algorithm and cooperative guidance law for high-maneuvering target salvo attack. Considering the maneuvering property of the target, a novel maneuvering model is proposed, which can adjust the maneuvering parameter adaptively. Based on the maneuvering target model, the interactive multiple models (IMM)-based distributed cubature information filtering (DCIF) algorithm is designed by two phases, named local filtering phase and consensus fusion phase. The final estimate results can be obtained by fusing the parallel local estimate results effectively with finite consensus fusion steps, which are used to design the cooperative guidance law for maneuvering target salvo attack. Besides, with necessary mild conditions, the lower bound and upper bound of the information matrix are proved to exist, and the stability of the proposed distributed algorithm is analyzed by Lyapunov stability theory and stochastic stability theory. Besides, the cooperative attack simulation example is given to validate the effectiveness of the proposed algorithm.

Covariance intersection based event-triggered distributed state estimation under channel independent DoS attacks

This paper investigates the event-triggered distributed state estimation problem for a class of discrete time-varying systems in the presence of denial-of-service (DoS) attacks, where each sensor node selectively shares its local information with neighbors. In contrast to the previous studies where the DoS attacks are considered on sensor-to-filter channels, we deal with the situation that DoS attacks jam each filter-to-filter communication channel independently. To reduce the communication rate and save network resources, a novel event-triggered communication strategy is presented that takes into account the impact of DoS attacks and is specialized for each communication channel. Based on the covariance intersection fusion rule and weight rearrangement method, a distributed state estimation algorithm is proposed. Further, the consistency of estimates and mean-square boundedness of estimation errors are proved under system collective observability and some other mild assumptions. Lastly, a numerical simulation is conducted to demonstrate the developed results and the effectiveness of the proposed algorithm.

Research on the design and implementation of computer experiment cloud platform under the application of big data technology

Abstract In this paper, the computer experiment cloud platform is built using big data technology, and various functions are implemented based on optimizing the platform parameters based on distributed estimation algorithms. The functional and non-functional requirements of the platform are determined, and the overall architecture design and system database design of the platform are carried out. The distributed estimation algorithm and the UDMA algorithm are used to identify the motor model, and the PID controller uses a particle swarm-based algorithm for parameter optimization. The platform system’s requirements are evaluated from environmental and performance perspectives to ensure that it meets the requirements proposed by the requirements analysis. The value of W(S i) is small, and the actual performance load of the platform remains. The performance of the platform function is good and can withstand a large amount of concurrency, and the average value of 90% response time is maintained at 5.8698s, showing an increasing trend.

Inverse-Covariance-Intersection-Based Distributed Estimation and Application in Wireless Sensor Network

In a sensor network, estimation performance may degrade when unknown correlations among local estimates are not addressed carefully. This article presents a novel distributed estimation algorithm based on inverse covariance intersection (ICI) for effectively solving the cross-correlation and dynamic state estimation problems in a wireless sensor network. The intermediate results of a set of consensus filters running in parallel are utilized to realize a global fusion of estimates, which involves all agents' local estimates and improves the estimation accuracy. Meanwhile, the global consistency of the proposed algorithm can be guaranteed theoretically since the fusion process considers all local estimates jointly and in a unified way. Furthermore, besides the asymptotic performance, the boundedness and consistency of the fused estimate can be achieved under finite iterations, which demonstrates its robustness and potential in practical applications. A cooperative target tracking problem illustrates the performance of the proposed algorithm.

An Estimation of Distribution Algorithm-Based Hyper-Heuristic for the Distributed Assembly Mixed No-Idle Permutation Flowshop Scheduling Problem

The distributed assembly mixed no-idle permutation flowshop scheduling problem (DAMNIPFSP), a common occurrence in modern industries like integrated circuit production, ceramic frit production, fiberglass processing, and steel-making, is a new model that considers mixed machines with no-idle restrictions as well as conventional machines. This article introduces an estimation of distribution algorithm-based hyper-heuristic (EDA-HH) to solve the DAMNIPFSP. Ten simple heuristic rules as low-level operations are utilized to search the solution space. The estimation of distribution algorithm is integrated into the framework of hyper-heuristic as the high-level strategy to control the low-level heuristics sequence in the solution space. The destruction and construction procedures are conducted on products and jobs in order to enhance the exploitation competence of EDA-HH. The computational simulation is carried out and the experimental results show that the proposed EDA-HH is significantly superior to the competitors in the statistical sense. The results of the 810 large-scale problem instances show the effectiveness of the EDA-HH in solving the DAMNIPFSP. Moreover, the CPLEX solver is utilized to verify the correctness of the model with some small instances.

A knowledge-driven co-evolutionary algorithm assisted by cross-regional interactive learning

Differential evolution (DE) and Estimation of distribution algorithm (EDA) exhibit complementary superiority in solving complex continuous optimization and engineering problems. The design of appropriate strategies coordinated with the two algorithms to balance exploration and exploitation is conducive to obtaining high-precision solutions. A knowledge-driven co-evolutionary algorithm assisted by a cross-regional interactive learning mechanism (KCACIL) is proposed to achieve a comprehensive collaboration between the algorithms, diverse strategies, and cross-regional individuals. Various elite-guided mutation strategies and a self-feedback strategy based on successful experience in light of implicit knowledge are devoted to fulfilling self-learning and cross-regional interactive learning to accomplish individual collaboration and knowledge transfer in the three regions. Reinforcement learning based on ε−greedy and simulated annealing is employed as feedback on the cross-regional individual information to promote the collaboration between opposition-based learning, interaction learning mechanism, and the revised strategy of inferior solutions with small Q values and high distance density. The dynamic self-adaptive adjustment strategies of multiple parameters are adopted to balance diversity and convergence. KCACIL is verified on the CEC 2014, 2017, 2020 benchmark test suites, and engineering applications. Experimental results indicate KCACIL is superior to the state-of-the-art comparison algorithms.

Retracted: Cultural Value and Strategy of Ethnic Music Based on Distribution Estimation Algorithm

Retracted: Cultural Value and Strategy of Ethnic Music Based on Distribution Estimation Algorithm

RETRACTED ARTICLE: Network Attribute Analysis and Competitiveness Evaluation of Auto Parts Industry Cluster for e-Commerce Platform

The automotive parts industry cluster is a complex operating system, and it is no longer possible to use a simple theory to make a scientific and reasonable explanation for the parts industry cluster. In view of this, the study takes the automotive parts industry cluster as the research object, innovatively invokes the theory of organizational ecology and constructs a competitiveness analysis mechanism based on population co-evolution. The study conducts performance analysis and simulation tests on the constructed model, integrating the CS–AHP evaluation method to evaluate the competitiveness of the parts industry cluster. The performance comparison results show that the research method has a minimum training error of 0.0108, when the number of iterations of the system is 69th. This method has a stable loss function value at the fifth iteration, which is a stable convergence state earlier than the GA algorithm, differential evolution and distribution estimation algorithm. The A-level index score of the off-line platform auto parts industry cluster is 0.5174, which is significantly greater than 0.5. The competitive cooperation effect, technological innovation effect and cluster culture scores of the e-commerce platform are 0.5885, 0.6899 and 0.5329, respectively, which are significantly higher than those of the off-line. The above results show that the accuracy of the research algorithm is higher than that of the off-line industry. The above results show that the accuracy of the research algorithm is better, which can make a reasonable scientific basis for the auto parts industry and carry out competitiveness evaluation. To a certain extent, it can provide technical reference for the future development of the auto field industry.